Representation Development from Pareto-Coevolution
نویسنده
چکیده
Genetic algorithms generally use a fixed problem representation that maps variables of the search space to variables of the problem, and operators of variation that are fixed over time. This limits their scalability on non-separable problems. To address this issue, methods have been proposed that coevolve explicitly represented modules. An open question is how modules in such coevolutionary setups should be evaluated. Recently, Pareto-coevolution has provided a theoretical basis for evaluation in coevolution. We define a notion of functional modularity, and objectives for module evaluation based on Pareto-Coevolution. It is shown that optimization of these objectives maximizes functional modularity. The resulting evaluation method is developed into an algorithm for variable length, open ended development of representations called DevRep. DevRep successfully identifies large partial solutions and greatly outperforms fixed length and variable length genetic algorithms on several test problems, including the 1024-bit Hierarchical-XOR problem.
منابع مشابه
Modular Variable-length Representations from Pareto-Coevolution
Genetic algorithms generally use a fixed problem representation that maps variables of the search space to variables of the problem, and operators of variation that are fixed over time. As a result, the potential to explore combinations of large partial solutions is limited. This is problematic when the search space of a problem is large, and scalability is required. To address this issue, seve...
متن کاملThe Incremental Pareto-Coevolution Archive
Coevolution can in principle provide progress for problems where no accurate evaluation function is available. An important open question however is how coevolution can be set up such that progress can be ensured. Previous work has provided progress guarantees either for limited cases or using strict acceptance conditions that can result in stalling. We present a monotonically improving archive...
متن کاملIntransitivity in Coevolution
We review and investigate the current status of intransitivity as a potential obstacle in coevolution. Pareto-Coevolution avoids intransitivity by translating any standard superiority relation into a transitive Pareto-dominance relation. Even for transitive problems though, cycling is possible. Recently however, algorithms that provide monotonic progress for Pareto-Coevolution have become avail...
متن کاملFinding Robust Texas Hold'em Poker Strategies Using Pareto Coevolution and Deterministic Crowding
متن کامل
Improving the Performance of Multiobjective Evolutionary Optimization Algorithms Using Coevolutionary Learning
This chapter introduces two algorithms for multiobjective optimization. These algorithms are based on a state-of-the-art Multiobjective Evolutionary Algorithm (MOEA) called Strength Pareto Evolutionary Algorithm 2 (SPEA2). The first proposed algorithm implements a competitive coevolution technique within SPEA2. In contrast, the second algorithm introduces a cooperative coevolution technique to ...
متن کامل